Contractible Hamiltonian Cycles in Triangulated Surfaces

نویسنده

  • Ashish Kumar Upadhyay
چکیده

A triangulation of a surface is called q-equivelar if each of its vertices is incident with exactly q triangles. In 1972 Altshuler had shown that an equivelar triangulation of torus has a Hamiltonian Circuit. Here we present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in equivelar triangulation of a surface. AMS classification : 57Q15, 57M20, 57N05.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Contractible Hamiltonian cycles in Polyhedral Maps

We present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to construct such cycles. This is further generalized and shown to hold for more general maps. AMS classification : 57Q15, 57M20, 57N05.

متن کامل

The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle

Triangulated irregular networks (TINs) are common representations of surfaces in computational graphics. We define the dual of a TIN in a special way, based on vertex-adjacency, and show that its Hamiltonian cycle always exists and can be found efficiently. This result has applications in transmission of large graphics datasets.

متن کامل

Mathematics of a Tetrahedron Chain and the Hamiltonian Cycle Problem

In this article we consider the problem of finding Hamiltonian cycles on a tetrahedral mesh. A Hamiltonian cycle is a closed loop through a tetrahedral mesh that visits each tetrahedron exactly once. Using techniques of a novel discrete differential geometry of n-simplices, we could immediately obtain Hamiltonian cycles on a rhombic dodecahedronshaped tetrahedral mesh consisting of 24 tetrahedr...

متن کامل

Hamiltonian Cycles in Triangle Graphs

We prove that the Hamiltonian cycle problem is NP complete for a class of planar graphs named triangle graphs that are closely related to inner triangulated graphs We present a linear time heuristic algorithm that nds a solution at most one third longer than the optimum solution and use it to obtain a fast rendering algorithm on triangular meshes in computer graphics

متن کامل

Lagrangian unknottedness in Stein surfaces

We show that the space of Lagrangian spheres inside the cotangent bundle of the 2-sphere is contractible. We then discuss the phenomenon of Lagrangian unknottedness in other Stein surfaces. There exist homotopic Lagrangian spheres which are not Hamiltonian isotopic, but we show that in a typical case all such spheres are still equivalent under a symplectomorphism.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1003.5268  شماره 

صفحات  -

تاریخ انتشار 2010